package leetcode.median;

/**
 * ClassName: $33_Search
 * Description:
 * date: 2022-02-19 21:51
 *
 * @author liyifan
 */
public class $33_Search {
    public int search(int[] nums, int target) {
        if (nums == null || nums.length == 0) {return -1;}
        if (nums.length == 1){return nums[0] == target ? 0 : -1;}
        int left = 0;
        int right = nums.length - 1;
        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] == target) {
                return mid;
            }
            if (nums[left] <= nums[mid]){
                if (target >= nums[left] && target <= nums[mid]) {
                    right = mid - 1;
                } else {
                    left = mid + 1;
                }
            } else {
                if (nums[mid] <= target && target <= nums[right]) {
                    left = mid + 1;
                } else {
                    right = mid - 1;
                }
            }
        }

        return -1;
    }
}
